A computer-oriented description of the Peaceman-Rachford ADI method
نویسندگان
چکیده
منابع مشابه
A matched Peaceman-Rachford ADI method for solving parabolic interface problems
A new Peaceman–Rachford alternating direction implicit (PR-ADI) method is proposed in this work for solving two-dimensional (2D) parabolic interface problems with discontinuous solutions. The classical ADI schemes are known to be inaccurate for handling interfaces. This motivates the development of a matched Douglas ADI (D-ADI) method in the literature, in which the finite difference is locally...
متن کاملStability and Convergence of the Peaceman-Rachford ADI Method for Initial-Boundary Value Problems
In this paper an analysis will be presented for the ADI (alternating direction implicit) method of Peaceman and Rachford applied to initial-boundary value problems for partial differential equations in two space dimensions. We shall use the method of lines approach. Motivated by developments in the field of stiff nonlinear ordinary differential equations, our analysis will focus on problems whe...
متن کاملStochastic Strictly Contractive Peaceman-Rachford Splitting Method
In this paper, we propose a couple of new Stochastic Strictly Contractive PeacemanRachford Splitting Method (SCPRSM), called Stochastic SCPRSM (SS-PRSM) and Stochastic Conjugate Gradient SCPRSM (SCG-PRSM) for large-scale optimization problems. The two types of Stochastic PRSM algorithms respectively incorporate stochastic variance reduced gradient (SVRG) and conjugate gradient method. Stochasti...
متن کاملOn the Effects of Scaling of the Peaceman-Rachford Method
The alternating direction method of Peaceman and Rachford is considered for elliptic difference schemes of second order and with two independent variables. An earlier result of the author's on the rapid convergence of multi-parameter noncommutative problems is described and a connection is established between that result and theorems on optimal scaling of band matrices. Simple algorithms to dec...
متن کاملA semi-proximal-based strictly contractive Peaceman-Rachford splitting method∗
The Peaceman-Rachford splitting method is very efficient for minimizing sum of two functions each depends on its variable, and the constraint is a linear equality. However, its convergence was not guaranteed without extra requirements. Very recently, He et al. (SIAM J. Optim. 24: 1011 1040, 2014) proved the convergence of a strictly contractive Peaceman-Rachford splitting method by employing a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1965
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/8.2.166